Distribution of coalitional power under probabilistic voting procedures
نویسنده
چکیده
Pattanaik and Peleg (1986) imposed regularity, ex-post Pareto optimality and independence of irrelevant alternatives on a probabilistic voting procedure and showed that: (i) the distribution of coalitional power for decisiveness in two-alternative feasible sets is subadditive in general, but additive if the universal set has at least four alternatives; and (ii) the distribution of coalitional power in an arbitrary feasible set is almost complete random dictatorship, and becomes complete random dictatorship under certain additional conditions. This paper formulates the problem in terms of citizens’ sovereignty and monotonicity conditions (which are in line with Arrow’s original work) instead of ex-post Pareto optimality and proves that: (i) Pattanaik and Peleg’s coalitional weights for decisiveness in two-alternative feasible sets become additive even with only three alternatives in the universal set; and (ii) the distribution of coalitional power in an arbitrary feasible set is completely characterized by random dictatorship without the additional conditions of Pattanaik and Peleg. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Approximating power indices
Many multiagent domains where cooperation among agents is crucial to achieving a common goal can be modeled as coalitional games. However, in many of these domains, agents are unequal in their power to affect the outcome of the game. Prior research on weighted voting games has explored power indices, which reflect how much “real power” a voter has. Although primarily used for voting games, thes...
متن کاملManipulation under voting rule uncertainty
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملManipulation Under Voting Rule Uncertainty1
An important research topic in the field of computational social choice is the complexity of various forms of dishonest behavior, such as manipulation, control, and bribery. While much of the work on this topic assumes that the cheating party has full information about the election, recently there have been a number of attempts to gauge the complexity of non-truthful behavior under uncertainty ...
متن کاملBoolean combinations of weighted voting games
Weighted voting games are a natural and practically important class of simple coalitional games, in which each agent is assigned a numeric weight, and a coalition is deemed to be winning if the sum of weights of agents in that coalition meets some stated threshold. We study a natural generalisation of weighted voting games called Boolean Weighted Voting Games (BWVGs). BWVGs are intended to mode...
متن کاملTwo New Measurements of Voting Power
The analysis of voting power in elections has been playing an important role in many traditional social choice problems, where the voting power of an agent is measured by whether the agent is pivotal. In this paper, we introduce two new extensions of such pivotality to measure agents’ voting power in a given profile. The first extension, called hierarchical pivotal sets, captures the voting pow...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Mathematical Social Sciences
دوره 40 شماره
صفحات -
تاریخ انتشار 2000